首页> 外文OA文献 >Fast ALS-based tensor factorization for context-aware recommendation from implicit feedback
【2h】

Fast ALS-based tensor factorization for context-aware recommendation from implicit feedback

机译:用于上下文感知推荐的基于aLs的快速张量因子分解   来自隐含的反馈

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Albeit, the implicit feedback based recommendation problem - when only theuser history is available but there are no ratings - is the most typicalsetting in real-world applications, it is much less researched than theexplicit feedback case. State-of-the-art algorithms that are efficient on theexplicit case cannot be straightforwardly transformed to the implicit case ifscalability should be maintained. There are few if any implicit feedbackbenchmark datasets, therefore new ideas are usually experimented on explicitbenchmarks. In this paper, we propose a generic context-aware implicit feedbackrecommender algorithm, coined iTALS. iTALS apply a fast, ALS-based tensorfactorization learning method that scales linearly with the number of non-zeroelements in the tensor. The method also allows us to incorporate diversecontext information into the model while maintaining its computationalefficiency. In particular, we present two such context-aware implementationvariants of iTALS. The first incorporates seasonality and enables todistinguish user behavior in different time intervals. The other views the userhistory as sequential information and has the ability to recognize usagepattern typical to certain group of items, e.g. to automatically tell apartproduct types or categories that are typically purchased repetitively(collectibles, grocery goods) or once (household appliances). Experimentsperformed on three implicit datasets (two proprietary ones and an implicitvariant of the Netflix dataset) show that by integrating context-awareinformation with our factorization framework into the state-of-the-art implicitrecommender algorithm the recommendation quality improves significantly.
机译:尽管基于隐式反馈的推荐问题-当只有用户历史记录可用而没有评分时-是现实应用中最典型的设置,但与显式反馈的情况相比,它的研究要少得多。如果应该保持可伸缩性,那么在显式情况下有效的最新算法无法直接转换为隐式情况。几乎没有隐含的反馈基准数据集,因此通常在显式基准上尝试新的想法。在本文中,我们提出了一种通用的上下文感知隐式反馈推荐算法,称为iTALS。 iTALS应用了一种基于ALS的快速张量分解学习方法,该方法与张量中非零元素的数量成线性比例。该方法还允许我们将各种上下文信息合并到模型中,同时保持其计算效率。特别是,我们介绍了iTALS的两个此类上下文感知实现变量。第一种结合了季节性因素,可以区分不同时间间隔内的用户行为。另一个将用户历史记录视为顺序信息,并具有识别某些项目组(例如,项目组)所特有的使用模式的能力。自动区分通常重复购买(收藏品,杂货)或一次(家用电器)的公寓产品类型或类别。在三个隐式数据集(两个专有数据集和Netflix数据集的一个隐式变量)上进行的实验表明,通过将上下文感知信息与我们的分解框架集成到最新的隐式推荐算法中,推荐质量得到了显着提高。

著录项

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类
  • 入库时间 2022-08-20 21:09:27

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号